Some algebra related to P- and Q-polynomial association schemes
نویسندگان
چکیده
Inspired by the theory of P -and Q-polynomial association schemes we consider the following situation in linear algebra. Let F denote a field, and let V denote a vector space over F with finite positive dimension. We consider a pair of linear transformations A : V → V and A : V → V satisfying the following four conditions. (i) A and A are both diagonalizable on V . (ii) There exists an ordering V0, V1, . . . , Vd of the eigenspaces of A such that AVi ⊆ Vi−1 + Vi + Vi+1 (0 ≤ i ≤ d), where V−1 = 0, Vd+1 = 0. (iii) There exists an ordering V ∗ 0 , V ∗ 1 , . . . , V ∗ δ of the eigenspaces of A ∗ such that AV ∗ i ⊆ V ∗ i−1 + V ∗ i + V ∗ i+1 (0 ≤ i ≤ δ), where V ∗ −1 = 0, V ∗ δ+1 = 0. (iv) There is no subspace W of V such that both AW ⊆ W , AW ⊆ W , other than W = 0 and W = V . We call such a pair a TD pair. Referring to the above TD pair, we show d = δ. We show that for 0 ≤ i ≤ d, the eigenspaces Vi and V ∗ i have the same dimension. Denoting this common dimension by ρi, we show the sequence ρ0, ρ1, . . . , ρd is symmetric and unimodal, i.e. ρi−1 ≤ ρi for 1 ≤ i ≤ d/2 and ρi = ρd−i for 0 ≤ i ≤ d. We show that there exists a sequence of scalars β, γ, γ, ̺, ̺ taken from F such that both 0 = [A,AA − βAAA+AA − γ(AA +AA)− ̺A], 0 = [A, AA− βAAA +AA − γ(AA+AA)− ̺A], where [r, s] means rs − sr. The sequence is unique if d ≥ 3. Let θi (resp. θ ∗ i ) denote the eigenvalue of A (resp. A) associated with Vi (resp. V ∗ i ), for 0 ≤ i ≤ d. We show the expressions θi−2 − θi+1 θi−1 − θi , θ i−2 − θ ∗ i+1 θ i−1 − θ ∗ i both equal β + 1, for 2 ≤ i ≤ d − 1. We hope these results will ultimately lead to a complete classification of the TD pairs.
منابع مشابه
On Relative $t$-Designs in Polynomial Association Schemes
Motivated by the similarities between the theory of spherical t-designs and that of t-designs in Q-polynomial association schemes, we study two versions of relative t-designs, the counterparts of Euclidean t-designs for P and/or Q-polynomial association schemes. We develop the theory based on the Terwilliger algebra, which is a noncommutative associative semisimple C-algebra associated with eac...
متن کاملProperties of Commutative Association Schemes Derived by Fglm Techniques
Association schemes are combinatorial objects that allow us solve problems in several branches of mathematics. They have been used in the study of permutation groups and graphs and also in the design of experiments, coding theory, partition designs etc. In this paper we show some techniques for computing properties of association schemes. The main framework arises from the fact that we can char...
متن کاملThe Terwilliger Algebras of Group Association Schemes
The Terwilliger algebra of an association scheme was introduced by Paul Terwilliger [7] in order to study P-and Q-polynomial association schemes. The purpose of this paper is to discuss in detail properties of the Terwilliger algebra of the group association scheme of a finite group. We shall give bounds on the dimension of the Terwilliger algebra, and define triple regularity. Let G be a finit...
متن کاملOn nonsymmetric P- and Q-polynomial association schemes
If a nonsymmetric P-polynomial association scheme, or equivalently. a distanceregular digraph, has diameter d and girth g. then d = g or d = g 1, by Damerell’s theorem. The dual of this theorem was proved by Leonard. In this paper, we prove that the diameter of a nonsymmetric Pand Q-polynomial association scheme is one less than its girth and its cogirth. We also give a structure theorem for a ...
متن کاملThe Subconstituent Algebra of an Association Scheme, (Part I)
We introduce a method for studying commutative association schemes with "many" vanishing intersection numbers and/or Krein parameters, and apply the method to the Pand Qpolynomial schemes. Let Y denote any commutative association scheme, and fix any vertex x of Y. We introduce a non-commutative, associative, semi-simple C-algebra T = T(x) whose structure reflects the combinatorial structure of ...
متن کاملLattice Polytopes , Ehrhart Polynomials , and Tutte Like Polynomials Associated with Graphs
Sept. 15, 9:00 – 9:50 William J. Martin Some Problems in the Theory of Q-Polynomial Association Schemes William J. Martin Worcester Polytechnic Institute Email: [email protected] Q-polynomial, or “cometric”, association schemes were defined in 1973. Perhaps the most important examples are the classical distance-regular graphs. Up until 1998, very little was known about Qpolynomial schemes which ar...
متن کامل